Algorithms for locomotives maintenance schedule
نویسندگان
چکیده
منابع مشابه
236825: Distributed Algorithms for Symmetry Breaking Schedule
Papers: [1a] R. Cole, and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking.
متن کاملPreventive Maintenance Schedule for Gear Manufacturing Shop Using Genetic Algorithm
The Genetic Algorithm (GA) has been used widely to solve an array of combinatorial optimization problems such as the traveling salesman problem, the job-shop scheduling problem, the quadratic assignment problem, and production planning problems. On the other hand, solving the problem of Preventive Maintenance (PM) scheduling for a group of non-identical machines using a GA is a relatively new t...
متن کاملSchedule and Condition Responsive Maintenance Strategies for Optimum Utilization of Maintenance Budget
–The maintenance of pavements and particularly for flexible pavement is an essential requirement for the efficiency of highway network. For better serviceability, flexible pavements require more maintenance as compared to maintenance required for rigid pavements. But developing counties like India does not have sufficient budget or funds to satisfy the requirements. The maintenance & rehabilita...
متن کاملAirline Schedule Planning: Integrated Models and Algorithms for Schedule Design and Fleet Assignment
C a profitable schedule is of utmost importance to an airline because its profitability is critically influenced by its flight offerings. We focus our attention on the steps of the airline schedule planning process involving schedule design and fleet assignment. Airline schedule design involves determining when and where to offer flights such that profits are maximized, and fleet assignment inv...
متن کاملPractical Fast Clock-Schedule Design Algorithms
SUMMARY In this paper, a practical clock-scheduling engine is introduced. The minimum feasible clock-period is obtained by using a modified Bellman-Ford shortest path algorithm. Then an optimum cost clock-schedule is obtained by using a bipartite matching algorithm. It also provides useful information to circuit synthesis tools. The experiment to a circuit with about 10000 registers and 100000 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.317